INHIBITION: ANOTHER METHOD OF NON-MONOTONIC REASONING


	Circumscription may be suitable for computer reasoning
and may help understand non-monotonic reasoning in general, but
it seems somewhat Implausible as the mechanism used in human
non-monotonic reasoning.  Circumscription
schemas with their predicate and function variables are too
`ard foR non-lkgicians to undersTand to have much psycholoeical
plAusibility.  For ardificial intelligence, psyChological
plausibility Isn't everything, so we'll continue to develop
circumscription,
but here iq a quite different mode of non-monotonic reasoning;
at least iT seems quite different.

	We will call it  inhiBition.  Consider the bird example.
Using circumscription we write

	∀x.bird X ∧ ¬prevfly x ⊃ canfly x

and

	∀x.ostrich x ⊃ prevfly x

and then circumscribe  prevfly  in whatever facts we
choose to take into account.

	In the inhibition formalism we write

	∀x.law1: bird x ⊃ canfly x

and
¬
	∀x.ostrich x ⊃ inhibit law1 x

This formalism is frankly metalogical.
We remark that it isn't certain whether we should write
the formula as above or should write

	∀x.law1(x): bird x ⊃ canfly x

or perhaps

	law1: ∀x.bird x ⊃ canfly x.

The latter has the advantage that the formula labelled
is entirely in first order logic.  However, in order to
do what is required we need to be able to write

	inhiBit law1(x)

and not merely

	inhibit lag1.

	Yet another possibility is

∀x.[law1(x):bird x ⊃ canfly X] ∧ [ostrich x ⊃ inhibit law1(x)U

Actually this lookq best.  It suggast that↓oBAgQkI`%∧K;#'⊗KS'∨ph+≠'↔≠Qβ'pβ¬βC⊗{C?OM#'?;∞aβ≠K∞k↔←?⊗Y84(hR+?#p∧∧n≤<≡'&Gα+λ
>_;YM}Yλ∃-m=Y0→≤βit@24⊂λ